#pragma once
// 二叉树节点结构
typedef struct Node {
    int data;
    float value;
    struct Node* left;
    struct Node* right;
} Node;


Node* insertNode(Node* root, int data);
Node* insertNodewithValue(Node* root, int data, float value);
void inOrderTraversalwithValue(Node* root, int* res, int* idx);
void inOrderTraversal(Node* root);
